Local Z-Buffering Rendering in Large Complex Scenes

A novel output sensitive real-time rendering algorithm local Z-buffering for the large complex scenes is presented in this paper. A naïve algorithm is proposed at first based on decomposing a large complex scene into a low-depth complexity scene and a large depth complexity by computing a partition plane in the view space. The low and high depth complexity scenes are visualized by Zbuffering and ray casting respectively. This naïve algorithm works well for densely occluded scenes. The naïve algorithm is refined by a series of acceleration algorithms from different point of views. The acceleration algorithms include the selectively lazy ray casting, objectoriented ray casting and a coherence based octree traverse algorithm .The final local Z-buffering algorithm requires the least preprocessing time and can achieve satisfactory speed-up averagely in the real-time rendering of large complex. Its performance can grow up with the improvements of the CPU and GPU capacities.